A Tabu Search Algorithm to Construct BIBDs Using MIP Solvers
نویسندگان
چکیده
BIBD (balanced incomplete block design) is instrumental in design of experiments. This is usually constructed using algebraic tools such as finite projective (or affine) algebra or difference sets. Recently, heuristic algorithms have been tried, including artificial neural networks, simulated annealing, and local search method. In this paper, we present a novel approach to construct BIBDs that makes use of MIP (mixed integer programming) solvers. Based on this, tabu search algorithms is given, and this is compared against the local search method presented by a previous researcher.
منابع مشابه
Using tabu search with ranking candidate list to solve production planning problems with setups
This study considers production planning problems involving multiple products, multiple resources, multiple periods, setup times, and setup costs. It can be formulated as a mixed integer program (MIP). Solving a realistic MIP production planning problem is NP-hard; therefore, we use tabu search methods to solve such a difficult problem. Furthermore, we improve tabu search by a new candidate lis...
متن کاملMulti-Objective Tabu Search Algorithm to Minimize Weight and Improve Formability of Al3105-St14 Bi-Layer Sheet
Nowadays, with extending applications of bi-layer metallic sheets in different industrial sectors, accurate specification of each layer is very prominent to achieve desired properties. In order to predict behavior of sheets under different forming modes and determining rupture limit and necking, the concept of Forming Limit Diagram (FLD) is used. Optimization problem with objective functions an...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملSolving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملComparisons of Commercial MIP Solvers and an Adaptive Memory (Tabu Search) Procedure for a Class of 0-1 Integer Programming Problems
The Boolean optimization problem (BOOP) is a highly useful formulation that embraces a variety of 0-1 integer programming problems, including weighted versions of covering, partitioning and maximum satisfiability problems. Several years ago Hvattum, Løkketangen and Glover (2006) introduced an adaptive memory (tabu search) method for BOOP which proved effective compared to competing approaches. ...
متن کامل